package cn360.d20210829.t1;

import java.util.Arrays;
import java.util.Scanner;

/**
 * <li style="color: red;">Prob</li>
 *
 * <li style="color: red;">Desc</li>
 *
 * <li style="color: red;">Link</li>
 *
 * @author habitplus
 * @since 2021-08-29 16:05
 */
public class Solution {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        int p = sc.nextInt();
        int q = sc.nextInt();
        int[] arr = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = sc.nextInt();
        }

        int ans = maxPassNum(arr, p, q);
        System.out.println(ans);
    }

    private static int maxPassNum(int[] arr, int p, int q) {
        if (arr == null || arr.length < 1 || p < 1 || q < 1 || p + q != 100) return 0;

        Arrays.sort(arr);
        int a = 100;
        int ans = 0;
        double s = 0;
        for (int i = arr.length - 1; i >= 0; i--) {
            a = (i == arr.length - 1 || arr[i] == arr[i+1]) ? a : a - 1;

            s = (double) (arr[i] * q + a * p) / 100;
            System.out.println(s);
            if (s >= 60.0)  ans++;
            else break;
        }

        return ans;
    }
}
